Logic form - PDFSEARCH.IO - Document Search Engine

Logic form
Results: 545

#	Item
201	Sage Reference Manual: Symbolic Logic Release 6.6.beta0 The Sage Development Team Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Mathematics Boolean algebra Semantics Logical connectives Tautology Sage Truth table Conjunctive normal form Negation Logic Propositional calculus Mathematical logic
202	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
203	MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2 Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:41:50 Mathematics Propositional calculus Unsatisfiable core Conjunctive normal form Resolution Logic programming First-order logic Logic Mathematical logic Automated theorem proving
204	SOLVING THE SATISFIABILITY PROBLEM USING MESSAGE-PASSING TECHNIQUES S. J. Pumphrey, May[removed]Part III Physics Project Report) A Bayesian message-passing technique, the sum-product algorithm, is described and applied to Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2001-06-07 06:04:05 Constraint programming Probability theory Boolean satisfiability problem Electronic design automation Logic in computer science Local search Bayesian inference Algorithm Conjunctive normal form Mathematics Theoretical computer science Applied mathematics
205	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
206	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
207	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
208	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming
209	Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Martina Seidl and Armin Biere Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:58:16 Model theory Automated theorem proving Boolean algebra Metalogic First-order logic Function True quantified Boolean formula Skolem normal form Resolution Mathematics Logic Mathematical logic
210	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving

UPDATE